BPMN 2.0 Execution Semantics Formalized as Graph Rewrite Rules: extended version
نویسندگان
چکیده
The Business Process Model and Notation (BPMN) standard version 2.0 informally defines a precise execution semantics. This paper defines that execution semantics formally, by defining the execution rules as graph rewrite rules. The paper shows that the formal definition of execution rules in this manner is intuitive and simple, in particular because they can be specified graphically, using the BPMN symbols, while maintaining mathematical rigour. Using graph rewriting tools, the resulting formal execution semantics can be used to directly execute models that are created in the BPMN. Therefore, it can be used as a reference implementation of the execution semantics and to test BPMN 2.0 engines, in combination with a set of BPMN test models that we also provide.
منابع مشابه
BPMN 2.0 Execution Semantics Formalized as Graph Rewrite Rules
This paper presents a formalization of a subset of the BPMN 2.0 execution semantics in terms of graph rewrite rules. The formalization is supported by graph rewrite tools and implemented in one of these tools, called GrGen. The benefit of formalizing the execution semantics by means of graph rewrite rules is that there is a strong relation between the execution semantics rules that are informal...
متن کاملA visual token-based formalization of BPMN 2.0 based on in-place transformations
Context The Business Process Model and Notation (BPMN) standard informally defines a precise execution semantics. It defines how process instances should be updated in a model during execution. Existing formalizations of the standard are incomplete and rely on mappings to other languages. Objective This paper provides a BPMN 2.0 semantics formalization that is more complete and intuitive than e...
متن کاملFormal Semantics and Implementation of BPMN 2.0 Inclusive Gateways
We present the first direct formalization of the semantics of inclusive gateways as described in the Business Process Modeling Notation (BPMN) 2.0 Beta 1 specification. The formal semantics is given for a minimal subset of BPMN 2.0 containing just the inclusive and exclusive gateways and the start and stop events. By focusing on this subset we achieve a simple graph model that highlights the pa...
متن کاملBPMN Core Modeling Concepts: Inheritance-Based Execution Semantics
We define an abstract model for the dynamic semantics of the core process modeling concepts in the OMG standard for BPMN 2.0. The UML class diagrams associated therein with each flow element are extended with a rigorous behavior definition, which reflects the inheritance hierarchy structure by refinement steps. The correctness of the resulting precise algorithmic model for an execution semantic...
متن کاملKRAM—Extended Report
Term rewriting proved to be a simple, uniform and powerful computational paradigm. Rewrite rules independently match and apply anywhere, unconstrained by the context. Rewriting is particularly appealing for defining truly concurrent systems, since rewrite rules can apply in parallel. Unfortunately, there is an inherent impediment in using term rewriting for defining concurrent systems or progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011